Secure Information Flow in Orc (DRAFT)

Secure information flow attempts to verify that programs do not leak information to unauthorized third parties. Previous approaches to secure information flow have considered classical sequential languages and concurrent languages based on channels. In this work, we demonstrate how techniques from secure information flow can be used to verify security properties of structured concurrent workflows expressed in the Orc calculus. Unlike channel-based concurrent languages, Orc imposes structure on the flow of information between processes, enabling more straightforward analysis of some programs. Orc also relies heavily on non-termination to manage control flow, requiring a more sophisticated analysis of termination properties.